Mixture model modal clustering
نویسندگان
چکیده
منابع مشابه
Modal Clustering in Univariate, Conjugate Dirichlet Process Mixture Models
The Dirichlet Process mixture (DPM) model is a popular nonparametric Bayesian tool for modeling unknown distributions through mixtures of components. Integrating out the latent location variables in a DPM model leads to a product partition model. This paper describes a modefinding algorithm which quickly finds either the maximizer of the partition posterior or the maximizer of the partition lik...
متن کاملMixture model averaging for clustering
Mixture Model Averaging for Clustering Yuhong Wei University of Guelph, 2012 Advisor: Dr. Paul D. McNicholas Model-based clustering is based on a finite mixture of distributions, where each mixture component corresponds to a different group, cluster, subpopulation, or part thereof. Gaussian mixture distributions are most often used. Criteria commonly used in choosing the number of components in...
متن کاملThe PDG-Mixture Model for Clustering
Within data mining, clustering can be considered the most important unsupervised learning problem which deals with finding a structure in a collection of unlabeled data. Generally, clustering refers to the process of organizing objects into groups whose members are similar. Among clustering approaches, those methods based on probabilistic models have been extensively developed, such as Näıve Ba...
متن کاملOn choosing a mixture model for clustering
Two methods for clustering data and choosing a mixture model are proposed. First, we derive a new classification algorithm based on the classification likelihood. Then, the likelihood conditional on these clusters is written as the product of likelihoods of each cluster, and AICrespectively BIC-type approximations are applied. The resulting criteria turn out to be the sum of the AIC or BIC rela...
متن کاملA mixture model for pose clustering
This paper describes a structural method for object alignment by pose clustering. The idea underlying pose clustering is to decompose the objects under consideration into k-tuples of primitive parts. By bringing pairs of k-tuples into correspondence, sets of alignment parameters are estimated. The global alignment corresponds to the set of parameters with maximum votes. The work reported here o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Data Analysis and Classification
سال: 2018
ISSN: 1862-5347,1862-5355
DOI: 10.1007/s11634-018-0308-3